منابع مشابه
Quasi-Eulerian Hypergraphs
We generalize the notion of an Euler tour in a graph in the following way. An Euler family in a hypergraph is a family of closed walks that jointly traverse each edge of the hypergraph exactly once. An Euler tour thus corresponds to an Euler family with a single component. We provide necessary and sufficient conditions for the existence of an Euler family in an arbitrary hypergraph, and in part...
متن کاملEulerian and Hamiltonian Directed Hypergraphs
Let H = (V ,E) be a directed hypergraph, also called a dihypergraph. Each vertex v ∈ V is incident to some hyperarcs in E . Conversely, each hyperarc E ∈ E is incident to some vertices in V . H is Eulerian if there is a dicycle C such that each hyperarc E ∈ E appears exactly once in C. Similarly, H is Hamiltonian if there is a dicycle C ′ such that every vertex v ∈ V appears exactly once in C ....
متن کاملEulerian and Hamiltonian dicycles in Directed hypergraphs
In this article, we generalize the concepts of Eulerian and Hamiltonian digraphs to directed hypergraphs. A dihypergraph H is a pair (V(H), E(H)), where V(H) is a non-empty set of elements, called vertices, and E(H) is a collection of ordered pairs of subsets of V(H), called hyperarcs. It is Eulerian (resp. Hamiltonian) if there is a dicycle containing each hyperarc (resp. each vertex) exactly ...
متن کاملQuasi-random hypergraphs revisited
The quasi-random theory for graphs mainly focuses on a large equivalent class of graph properties each of which can be used as a certificate for randomness. For k-graphs (i.e., k-uniform hypergraphs), an analogous quasi-random class contains various equivalent graph properties including the k-discrepancy property (bounding the number of edges in the generalized induced subgraph determined by an...
متن کاملQuasi-random hypergraphs revisited
The quasi-random theory for graphs mainly focuses on a large equivalent class of graph properties each of which can be used as a certificate for randomness. For k-graphs (i.e., k-uniform hypergraphs), an analogous quasi-random class contains various equivalent graph properties including the k-discrepancy property (bounding the number of edges in the generalized induced subgraph determined by an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2017
ISSN: 1077-8926
DOI: 10.37236/6361